Maximum Balanced Flow in a Network
نویسندگان
چکیده
منابع مشابه
Maximum Network Flow of Multiple Description Codes
Multiple description coding (MDC) is a powerful technique for robust real-time communications over packet switched lossy networks, such as the Internet, peer-to-peer, ad hoc, wireless, and sensor networks. This paper is concerned with optimal network flows of MDC packets from multiple sources to multiple receivers to maximize a weighted sum of fidelities achieved by all receivers. For general n...
متن کاملBalancing Applied to Maximum Network Flow
We explore balancing as a definitional and algorithmic tool for finding minimum cuts and maximum flows in ordinary and parametric networks. We show that a standard monotonic parametric maximum flow problem can be formulated as a problem of computing a particular maximum flow that is balanced in an appropriate sense. We present a divide-and-conquer algorithm to compute such a balanced flow in a ...
متن کاملThe maximum flow problem of uncertain network
The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. T...
متن کاملA note on the maximum flow through a network
-This note discusses the problem of maximizing the rate of flow from one terminal to another, through a network which consists of a number of branches, each of which has a !imited capacity. The main result is a theorem: The maximum possible flow from left to right through a network is equal to the minimum value among all simple cut-sets. This theorem is applied to solve a more general problem, ...
متن کاملA Balanced Memory Network
A fundamental problem in neuroscience is understanding how working memory--the ability to store information at intermediate timescales, like tens of seconds--is implemented in realistic neuronal networks. The most likely candidate mechanism is the attractor network, and a great deal of effort has gone toward investigating it theoretically. Yet, despite almost a quarter century of intense work, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2000
ISSN: 0095-8956
DOI: 10.1006/jctb.1999.1940